- Title
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
- Creator
- Liu, Shun-yi; Zhang, He-ping; Lu, Hong-liang; Lin, Yu-qing
- Relation
- Acta Mathematicae Applicatae Sinica Vol. 32, Issue 4, p. 883-890
- Publisher Link
- http://dx.doi.org/10.1007/s10255-016-0608-3
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2016
- Description
- A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest integer k for which G has a strong k-edge-coloring. In this paper, we have shown that the strong chromatic index is no larger than 6 for outerplanar graphs with maximum degree 3.
- Subject
- strong edge-coloring; strong chromatic index; outerplanar graphs
- Identifier
- http://hdl.handle.net/1959.13/1326269
- Identifier
- uon:25392
- Identifier
- ISSN:0168-9673
- Language
- eng
- Reviewed
- Hits: 1260
- Visitors: 1247
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|